Experimental Analysis of Involutive Criteria
نویسندگان
چکیده
In this paper we present results of our computer experiments to study effectiveness of involutive criteria for avoiding useless prolongations in construction of polynomial Janet bases. These bases are typical representative of involutive bases. Though involutive bases are usually redundant as Gröbner ones, they can be used as well as the reduced Gröbner bases in whose theory Volker Weispfenning made a substantial contribution. Our experimental study shows that the role of criteria in the involutive approach is definitely weaker than that in Buchberger’s algorithm.
منابع مشابه
Detecting unnecessary reductions in an involutive basis computation
We consider the check of the involutive basis property in a polynomial context. In order to show that a finite generating set F of a polynomial ideal I is an involutive basis one must confirm two properties. Firstly, the set of leading terms of the elements of F has to be complete. Secondly, one has to prove that F is a Gröbner basis of I. The latter is the time critical part but can be acceler...
متن کاملInvolutive Algorithms for Computing Gröbner Bases
In this paper we describe an efficient involutive algorithm for constructing Gröbner bases of polynomial ideals. The algorithm is based on the concept of involutive monomial division which restricts the conventional division in a certain way. In the presented algorithm a reduced Gröbner basis is the internally fixed subset of an involutive basis, and having computed the later, the former can be...
متن کاملA Variant of Gerdt's Algorithm for Computing Involutive Bases
In [Ger05], the first author presented an efficient algorithm for computing involutive (and reduced Gröbner) bases. In this paper, we consider a modification of this algorithm which simplifies matters to understand it and to implement. We prove correctness and termination of the modified algorithm and also correctness of the used criteria. The proposed algorithm has been implemented in Maple. W...
متن کاملTense like equality algebras
In this paper, first we define the notion of involutive operator on bounded involutive equality algebras and by using it, we introduce a new class of equality algebras that we called it a tense like equality algebra. Then we investigate some properties of tense like equality algebra. For two involutive bounded equality algebras and an equality homomorphism between them, we prove that the tense ...
متن کاملInvolutive Bases of Polynomial Ideals
In this paper we consider an algorithmic technique more general than that proposed by Zharkov and Blinkov for the involutive analysis of polynomial ideals. It is based on a new concept of involutive monomial division which is defined for a monomial set. Such a division provides for each monomial the self-consistent separation of the whole set of variables into two disjoint subsets. They are cal...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005